منابع مشابه
Computational principal agent problems
Collecting and processing large amounts of data is becoming increasingly crucial in our society. We model this task as evaluating a function f over a large vector x = (x1, . . . , xn), which is unknown, but drawn from a publicly known distribution X. In our model learning each component of the input x is costly, but computing the output f(x) has zero cost once x is known. We consider the proble...
متن کاملDynamic Principal-Agent Problems
We consider a continuous-time setting, in which the agent can control both the drift and the volatility of the underlying process. The principal can observe the agent’s action and can offer payment at a continuous rate, as well as a bulk payment at the end of the fixed time horizon. In examples, we show that if the principal and the agent have the same CRRA utility, or they both have (possibly ...
متن کاملPrincipal-Agent Problems with Exit Options
We consider the problem of when to deliver the contract payoff, in a continuoustime Principal-Agent setting, in the presence of moral hazard and/or adverse selection. The principal can design contracts of a simple form that induce the agent to ask for the payoff at the time of principal’s choosing. The optimal time of payment depends on the agent’s and the principal’s outside options. Examples ...
متن کاملAsymptotic Efficiency in Dynamic Principal-Agent Problems
In a seminal paper, B. R. Holmstro m and P. R. Milgrom (1987, Econometrica 55, 303 328) examine a principal-agent model in which the agent continuously controls the drift rate of a Brownian motion. Given a stationary environment, they show that the optimal sharing rule is a linear function of aggregated output. This paper considers a variant of the Brownian model in which control revisions take...
متن کاملDynamic programming approach to principal-agent problems
We consider a general formulation of the Principal-Agent problem with a lump-sum payment on a finite horizon. Our approach is the following: we first find the contract that is optimal among those for which the agent’s value process allows a dynamic programming representation and for which the agent’s optimal effort is straightforward to find. We then show that, under technical conditions, the o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Economics
سال: 2018
ISSN: 1933-6837
DOI: 10.3982/te1815